#include <iostream>
#include <vector>

std::vector<int> interection(std::vector<int> &a, std::vector<int> &b)
{
    std::vector<int> c;
    int max_x = a[0] > b[0] ? a[0] : b[0];
    int min_y = a[1] < b[1] ? a[1] : b[1];
    int min_x = a[2] < b[2] ? a[2] : b[2];
    int max_y = a[3] > b[3] ? a[3] : b[3];

    if (min_x < max_x || min_y < max_y)
    {
        c.push_back(0);
        c.push_back(0);
        c.push_back(0);
        c.push_back(0);
    }
    else
    {
        c.push_back(max_x);
        c.push_back(min_y);
        c.push_back(min_x);
        c.push_back(max_y);
    }

    return c;
}

int main()
{
    std::vector<int> s1(4), s2(4), s3(4);
    std::cin >> s1[0] >> s1[1] >> s1[2] >> s1[3];
    std::cin >> s2[0] >> s2[1] >> s2[2] >> s2[3];
    std::cin >> s3[0] >> s3[1] >> s3[2] >> s3[3];

    s1[2] += s1[0];
    s1[3] = s1[1] - s1[3];
    s2[2] += s2[0];
    s2[3] = s2[1] - s2[3];
    s3[2] += s3[0];
    s3[3] = s3[1] - s3[3];

    std::vector<int> k = interection(s1, s2);
    std::vector<int> p = interection(s3, k);

    // for (int i = 0; i < 4; i++)
    // {
    //     std::cout << s1[i] << " " << s2[i] << " " << s3[i] << " " << k[i] << " " << p[i] << std::endl;
    // }

    int area = abs((p[2] - p[0]) * (p[3] - p[1]));
    std::cout << area << std::endl;
    return 0;

    return 0;
}